On Solutions of the Diophantine Equations $p^4 + q^4 = z^2$ and $p^4-q^4= z^2$ when p and q are Primes
نویسندگان
چکیده
منابع مشابه
A Q4/Q4 continuum structural topology optimization implementation
A node-based design variable implementation for continuum structural topology optimization in a finite element framework is presented and its properties are explored in the context of solving a number of different design examples. Since the implementation ensures Ccontinuity of design variables, it is immune to elementwise checkerboarding instabilities that are a concern with element-based desi...
متن کاملexistence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types
بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی بیان شده اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...
15 صفحه اولThe Diophantine Equation 8x + py = z2
Let p be a fixed odd prime. Using certain results of exponential Diophantine equations, we prove that (i) if p ≡ ± 3(mod 8), then the equation 8 (x) + p (y) = z (2) has no positive integer solutions (x, y, z); (ii) if p ≡ 7(mod 8), then the equation has only the solutions (p, x, y, z) = (2 (q) - 1, (1/3)(q + 2), 2, 2 (q) + 1), where q is an odd prime with q ≡ 1(mod 3); (iii) if p ≡ 1(mod 8)...
متن کاملConstrained Percolation on Z2
We study a constrained percolation process on Z, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability measures. Unlike the unconstrained case, in the constrained case no stochastic monotonicity is known. We prove the nonexistence of infinite clusters and contours for the constrained percolation by developing new combinatorial techniques which...
متن کاملThe Structure of One Weight Linear and Cyclic Codes Over Z2^r x (Z2+uZ2)^s
Inspired by the Z2Z4-additive codes, linear codes over Z r 2×(Z2 + uZ2) s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Zr2×(Z2 + uZ2) s have some advantages compared to Z2Z4-additive codes. A code is called constant weight(one weight) if all the codewords have the same weight. It is well known that constant wei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Mathematics
سال: 2019
ISSN: 2279-087X,2279-0888
DOI: 10.22457/apam.594v19n1a1